AutoSAC: automatic scaling and admission control of forwarding graphs
نویسندگان
چکیده
منابع مشابه
Expedited Forwarding Delay Budget Through a Novel Call Admission Control
Call admission control is a principal component for QoS delivery in IP networks. It determines the extent to which network resources are utilized. It determines also whether QoS are actually delivered or not. Continuing on the steps of the existing approaches, we introduce a distributed and scalable admission control scheme to provide end-to-end statistical QoS guarantees in Differentiated Serv...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولAdmission control in stochastic event graphs
In this paper, we show that the expected workload and the expected waiting time in (max,+) linear system under a single input sequence is multimodular. We use this result to construct the optimal deterministic admission control in the (max,+) system under rate constraints. Gaujal is a member of a common project between CNRS, UNSA and INRIA. Contrrle d'admission dans les graphes d''vnements stoc...
متن کاملEdge-forwarding Index of Star Graphs and Other Cayley Graphs
We present a technique for building, in some Cayley graphs, a routing for which the load of every edge is almost the same. This technique enables us to nd the edge-forwarding index of star graphs and complete-transposition graphs.
متن کاملExpanding and forwarding parameters of product graphs
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network—the undirected graph with a given routing. Many large networks are composed from some existing smaller networks by using, in terms of graph theory, Cartesian product. The expanding and forwarding parameters of such large networks are associated strongly with that of the corresponding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Telecommunications
سال: 2017
ISSN: 0003-4347,1958-9395
DOI: 10.1007/s12243-017-0597-0